Generalized Hamming Weights of q-ary Reed-Muller Codes
نویسندگان
چکیده
The order bound on generalized Hamming weights is introduced in a general setting of codes on varieties which comprises both the one point geometric Goppa codes as the q-ary Reed-Muller codes. For the latter codes it is shown that this bound is sharp and that they satisfy the double chain condition.
منابع مشابه
Relative generalized Hamming weights of $q$-ary Reed-Muller codes
Coset constructions of q-ary Reed-Muller codes can be used to store secrets on a distributed storage system in such a way that only parties with access to a large part of the system can obtain information while still allowing for local error-correction. In this paper we determine the relative generalized Hamming weights of these codes which can be translated into a detailed description of the i...
متن کاملOn the Feng-Rao Bound for Generalized Hamming Weights
The Feng-Rao bound gives good estimates of the minimum distance of a large class of codes. In this work we are concerned with the problem of how to extend the Feng-Rao bound so that it deals with all the generalized Hamming weights. The problem was solved by Heijnen and Pellikaan in [7] for a large family of codes that includes the duals of one-point geometric Goppa codes and the q-ary Reed-Mul...
متن کاملA Lower Bound for Generalized Hamming Weights and a Condition for t-th Rank MDS∗
In this paper, we introduce a lower bound for the generalized Hamming weights, which is applicable to arbitrary linear code, in terms of the notion of well-behaving. We also show that any [n, k] linear code C over a finite field F is the t-th rank MDS for t such that g(C) + 1 ≤ t ≤ k where g(C) is easily calculated from the basis of F so chosen that whose first n − k elements generate C⊥. Final...
متن کاملGeneralized Reed - Muller Codes and Curves with Many Points
In the quest for curves over finite fields with many points coding theory has been a useful guide, as words of low weight in trace codes correspond to Artin-Schreier curves with many points. This correspondence can be extended to subcodes of low weight and fibre products of Artin-Schreier curves. Subcodes of minimum weight of a code C determine the weight hierarchy of C and knowledge of the wei...
متن کامل4-Ary Codebook Design Using Reed-Muller Codes for MIMO Beamforming Systems
We design 4-ary codebooks using Reed Muller codes for multiple-input multiple-output (MIMO) beamforming systems. An upperbound on the maximum correlation magnitude metric of a 4-ary codebook is derived from the minimum Hamming distance of the corresponding binary linear block code. The 4-ary MIMO beamforming codebooks for the number of transmit antennas equal to 4, 8, 16, and 32 are tabulated. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 44 شماره
صفحات -
تاریخ انتشار 1998